Fair Public-Key Cryptosystems
نویسنده
چکیده
W e show how co construct public-key cryptosysterns that are fair, that is, strike a good balance, in a democratic country, between the needs of the Government and those of the Citizens. Fair public-key cryptosystems guarantee that: (1) the systcm cannot be misused by criminal organizations and ( 2 ) the Citizens rnantain exactly the same rights to privacy they currently have under the law. We actually show how to transform any public-key cryptosystem into a fair one. The transformed systems preserve the security and efficiency of the original ones. Thus one can still US^ whatever system he believes to be more secure, and enjoy the additional properties of fairness. Moreover, for today's best known cryptosystems. w e show that the transformation to fair ones is particulariy efficient and convenient. As we shall explain, our solution compares favorably with the Clipper Chip, the encryption proposal more recently p u t forward by the Clinton Administration for solving similar problems. Note For The Reader. Since privacy and law enforcement interest most of society, and since we would welcome an informed debate before m h g crucial policy decisions in this area. we have made a sincere attempt to reach a broad audience. W e thus hope that at least the goals and the properties of our approach will he understandable by the Government official and the Citizen who do not have any familiarity with cryptography. Further, the basic technical ideas of our solution --which are quite simple to begin with-are presented at a very intuitive level. so 3s to be enjoyable for the reader generally familiar with the field of cryptography, though not necessarily an expert in secure protocol design. Such an expert will not have great difficulty in filling in the formalization and the occasionally subtle technical details that have been omitted in this draft. (We actually hope to have given her sufficient indications to make her journey through this draft as short as possible.) W e apologize for not having the lime to write different versions of this paper for different audiences. E.F. Brlckell (Ed.): Advances In Cryptology CRYPT0 '92, LNCS 740, pp. 113-138, 1993. 0 Spnnger-Verlag Berlln Heidelberg 1993
منابع مشابه
QTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملAn Efficient and Secure Pairing-Based Fair Blind Signature Scheme with Message Recovery
In this paper, we propose a new fair blind signature scheme with message recovery using pairing-based self-certified public key cryptosystems. Preserving the merits inherent in pairing-based cryptosystems, it can possess fewer bits to achieve the higher security level. In addition, our new scheme has the advantage that the authentication of the public key can be accomplished with the verificati...
متن کاملComparison of two Public Key Cryptosystems
Since the time public-key cryptography was introduced by Diffie andHellman in 1976, numerous public-key algorithms have been proposed. Some of thesealgorithms are insecure and the others that seem secure, many are impractical, eitherthey have too large keys or the cipher text they produce is much longer than theplaintext. This paper focuses on efficient implementation and analysis of two mostpo...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملVeriiable Escrowed Signature
We combine a publicly veriiable encryption technique and a Schnorr type signature scheme to achieve a veriiable escrowed signature scheme. The scheme allows a signer to convince a veriier the validity of a signature without letting him see the signature value. The unavailable but veriiable signature is encrypted under a public key of someone (e.g., a trusted third party) who stays oo-line. The ...
متن کامل